HORAYZON v1.2: an efficient and flexible ray-tracing algorithm to compute horizon and sky view factor

نویسندگان

چکیده

Abstract. Terrain parameters like topographic horizon and sky view factor (SVF) are used in numerous fields applications. In atmospheric climate modelling, such utilised to parameterise the effect of terrain geometry on radiation exchanges between surface atmosphere. Ideally, these derived from a high-resolution digital elevation model (DEM) because inferring them coarser data induces smoothing effect. Computing with conventional algorithms, however, is slow large amounts non-local have be processed. We propose new more efficient method, which based high-performance ray-tracing library. The algorithm can speed up calculation by 2 orders magnitude relative approach. By applying simplification remote topography, ray-tracing-based also applied very (<5 m) DEM data, would otherwise induce an excessive memory footprint. accompanied SVF algorithm, was verified work accurately for all – even steep complex terrain. compare computational performance accuracy two reference methods literature illustrate its benefits. Finally, we how sub-grid values efficiently computed newly wide range target grid resolutions (1–25 km).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient and Stable Ray Tracing Algorithm for Parametric Surfaces

In this paper, we propose an efficient and stable algorithm for finding the ray-surface intersections. Newton’s method and Bézier clipping are adapted to form the core of our algorithm. Ray coherence is used to find starting points for Newton iteration. We introduce an obstruction detection technique to verify whether an intersection point found by using Newton’s method is the closest one. When...

متن کامل

A Flexible Algorithm for Multiprocessor Ray Tracing

Ray tracing programs are widely used to generate photo-realistic images, but the high computation time may discourage their implementation on single-processor machines; moreover, cost reduction of multi-processor general purpose architectures makes parallel rendering an attractive field of research. We propose a new algorithm which addresses the main issues of a parallel implementation of ray t...

متن کامل

Ray-tracing and Interferometry in Schwarzschild Geometry

Here, we investigate the possible optical anisotropy of vacuum due to gravitational field. In doing this, we provide sufficient evidence from direct coordinate integration of the null-geodesic equations obtained from the Lagrangian method, as well as ray-tracing equations obtained from the Plebanski’s equivalent medium theory. All calculations are done for the Schwarzschild geometry, which resu...

متن کامل

Bended Surfaces for Ray Tracing: A Fast View-Dependent Algorithm

We present a fast view-dependent algorithm for ray tracing bended surfaces deened by triangular F-patches. We give up the notion of uniqueness for the surfaces, i.e., a plane containing the ray innuences the shape of the surface. However, the resulting surfaces appear smooth and continuous to the observer. F-patches can be joined G 1-continuous. The method both has low memory consumption and fa...

متن کامل

An Algorithm to Compute

The following problem is addressed: given square matrices A and B, compute the smallest such that A + E and B + F have a common eigenvalue for some E, F with max(‖E‖2, ‖F‖2) ≤ . An algorithm to compute this quantity to any prescribed accuracy is presented, assuming that eigenvalues can be computed exactly.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Geoscientific Model Development

سال: 2022

ISSN: ['1991-9603', '1991-959X']

DOI: https://doi.org/10.5194/gmd-15-6817-2022